Computer and Modernization ›› 2010, Vol. 1 ›› Issue (11): 16-18,2.doi: 10.3969/j.issn.1006-2475.2010.11.005

• 算法设计与分析 • Previous Articles     Next Articles

Incremental Algorithm of Maintaining Concept Lattice

LIU Na, HE Feng   

  1. School of Computer Science and Engineering, North University for the Nationalities, Yinchuan 750021, China
  • Received:2010-05-10 Revised:1900-01-01 Online:2010-11-25 Published:2010-11-25

Abstract:

Concept lattice, induced from a binary relation between objects and features, is a very useful formal tool and fit for discovering the potential concept below the data. The algorithm of the lattice is still the hot spot. The structure of node in lattice, which is called association rule lattice and modified according to the requirements and the data structure of linkedlist with a head finger and a trail finger is adopted. Based on this, the incremental algorithm for maintaining concept lattice is put forward. The algorithm is analyzed with better time and space efficiency than other algorithms.

Key words: concept lattice, data mining, linked list, incremental, maintaining

CLC Number: